SEN - 1004 ) 10 th International Workshop on Coalgebraic Methods in Computer Science
نویسندگان
چکیده
The powerset construction is a standard method for converting a non-deterministic automaton into an equivalent deterministic one as far as language is concerned. In this short paper, we lift the powerset construction on automata to the more general framework of coalgebras with enriched state spaces. Examples of applications includes transducers, and Rabin probabilistic automata.
منابع مشابه
10 th International Workshop on Coalgebraic Methods in Computer Science
Solutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad C “generated” by solutions of recursive ...
متن کاملProceedings ( preliminary version ) 10 th International Workshop on Coalgebraic Methods in Computer Science
Solutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad C “generated” by solutions of recursive ...
متن کاملON ALGEBRAIC AND COALGEBRAIC CATEGORIES OF VARIETY-BASED TOPOLOGICAL SYSTEMS
Motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by S. Vickers, providing an algebraic and a coalgebraic category of the new structures. As a result, the nature of the category TopSys of S. Vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...
متن کاملComputer Science Logic 2012 26 th International Workshop 21 th Annual Conference of the EACSL CSL ’ 12
s of Invited Talks Sharing Distributed Knowledge on the WebSerge Abiteboul . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 ConnectingComplexityClasses,WeakFormalTheories, andPropositional Proof SystemsStephen A. Cook . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملFederated Conference on Computer Science and Information Systems - FedCSIS 2011, Szczecin, Poland, 18-21 September 2011, Proceedings
• AAIA'2013 8 International Symposium Advances in Artificial Intelligence and Applications • AIMA'2013 International Workshop on Artificial Intelligence in Medical Applications • ASIR’2013 2nd International Workshop on Advances in Semantic Information Retrieval • WCO'2013 Workshop on Computational Optimization • CSNS – Computer Science & Networked Systems • CANA'13 6th Computer Aspects of Numer...
متن کامل